On Characterization of Relation Based Rough Set Algebras

Granulation of a universe of discourse is one of the important aspects whose solution has significant bearing on Granular Computing (GrC). Many models and methods of GrC concentrating on concrete models in special contexts have been proposed and studied over the years. Rough set theory is one of the most advanced areas popularizing GrC. The concept of a rough set was originally proposed by Pawlak (1982) as a formal tool for modeling and processing intelligent systems characterized by insufficient and incomplete information. Using the concepts of lower and upper approximations in rough set theory, knowledge hidden in information systems may be unravelled and expressed in the form of decision rules (Pawlak, 1991; Zhang et al, 2003). abstraCt